The Crest Factor for Trigonometric Polynomials Part I: Approximation Theoretical Estimates
نویسنده
چکیده
The Chebyshev norm of a degree n trigonometric polynomial is estimated against a discrete maximum norm based on equidistant sampling points where, typically, oversampling rather than critical sampling is used. The bounds are derived from various methods known from classical Approximation Theory. These estimates are of fundamental importance for the design of efficient OFDM in communication systems.
منابع مشابه
Approximation by polynomials
1. Introduction 2. The Weierstrass approximation theorem 3. Estimates for the Bernstein polynomials 4. Weierstrass' original proof 5. The Stone–Weierstrass approximation theorem 6. Chebyshev's theorems 7. Approximation by polynomials and trigonometric polynomials 8. The nonexistence of a continuous linear projection 9. Approximation of functions of higher regularity 10. Inverse theorems Referen...
متن کاملMonotone trigonometric approximation
Let f ∈ C[−ω, ω], 0 < ω < π, be nonlinear and nondecreasing. We wish to estimate the degree of approximation of f by trigonometric polynomials that are nondecreasing in [−ω, ω]. We obtain estimates involving the second modulus of smoothness of f and show that one in general cannot have estimates with the third modulus of smoothness.
متن کاملApproximation of multivariate functions by trigonometric polynomials based on rank-1 lattice sampling
In this paper, we present algorithms for the approximation of multivariate functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of functions in periodic Sobolev spaces of dominating mixed smoothness. Recently an algorithm for the trigonometric interpolation on generalized sparse grids...
متن کاملOptimal Bell Functions for Biorthogonal Local Trigonometric Bases
A general approach for biorthogononal local trigonometric bases in the two-overlapping setting was given by Chui and Shi. In this paper, we give error estimates for the approximation with such basis functions. In particular, it is shown that for a partition of the real axis into small intervals one obtains better approximation order if polynomials are reproduced locally. Furthermore, smooth tri...
متن کاملApproximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
In this paper, we present algorithms for the approximation of multivariate periodic functions by trigonometric polynomials. The approximation is based on sampling of multivariate functions on rank-1 lattices. To this end, we study the approximation of periodic functions of a certain smoothness. Our considerations include functions from periodic Sobolev spaces of generalized mixed smoothness. Re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001